On the Gap Inequalities for the Max-Cut Problem
نویسندگان
چکیده
Laurent & Poljak introduced a class of valid inequalities for the max-cut problem, called gap inequalities, which include many other known inequalities as special cases. The gap inequalities have received little attention and are poorly understood. This paper presents the first ever computational results. In particular, we start presenting a cuttingplane scheme based on an effective heuristic separation algorithm for gap inequalities, and showing that these yield extremely strong upper bounds in practice. Then, we propose an exact separation algorithm for gap inequalities to compute exact gap integrality ratios for small max-cut polytopes.
منابع مشابه
Complexity results for the gap inequalities for the max-cut problem
We prove several complexity results about the gap inequalities for the max-cut problem, including: (i) the gap-1 inequalities do not imply the other gap inequalities, unless NP = CoNP; (ii) there must exist non-redundant gap inequalities with exponentially large coefficients, unless NP = CoNP; (iii) the associated separation problem can be solved in finite (doubly exponential) time.
متن کاملGap Inequalities for the Max-Cut Problem: A Cutting-Plane Algorithm
Laurent & Poljak introduced a class of valid inequalities for the max-cut problem, called gap inequalities, which include many other known inequalities as special cases. The gap inequalities have received little attention and are poorly understood. This paper presents the first ever computational results. In particular, we describe heuristic separation algorithms for gap inequalities and their ...
متن کاملA Note on the Integrality Gap in the Nodal Interdiction Problem
In the maximum flow network interdiction problem, an attacker attempts to minimize the maximum flow by interdicting flow on the arcs of network. In this paper, our focus is on the nodal interdiction for network instead of the arc interdiction. Two path inequalities for the node-only interdiction problem are represented. It has been proved that the integrality gap of relaxation of the maximum fl...
متن کاملGap inequalities for non-convex mixed-integer quadratic programs
Laurent and Poljak introduced a very general class of valid linear inequalities, called gap inequalities, for the max-cut problem. We show that an analogous class of inequalities can be defined for general nonconvex mixed-integer quadratic programs. These inequalities dominate some inequalities arising from a natural semidefinite relaxation.
متن کاملLinear optimization of fuzzy relation inequalities with max-Lukasiewicz composition
In this paper, we study the finitely many constraints of fuzzy relation inequalities problem and optimize the linear objective function on this region which is defined with fuzzy max-Lukasiewicz operator. In fact Lukasiewicz t-norm is one of the four basic t-norms. A new simplification technique is given to accelerate the resolution of the problem by removing the components having no effect on ...
متن کامل